New Closedness Results for Efficient Sets in Multiple Objective Mathematical Programming
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملA necessary condition for multiple objective fractional programming
In this paper, we establish a proof for a necessary condition for multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we present the related semi parametric model.
متن کاملa multiple objective programming model for designing of supply chain network with efficient manufacturers and distributers
one of the most important decisions in supply chain network (scn) design is choosing the optimal location for the facilities. the facilities in scn have different efficiency according to their locations. in this paper, efficiency of facilities is added to the supply chain network design by using data envelopment analysis model, and a multi-objective model is presented for the design of efficien...
متن کاملExact generation of epsilon-efficient solutions in multiple objective programming
It is a common characteristic of many multiple objective programming problems that the efficient solution set can only be identified in approximation: since this set often contains an infinite number of points, only a discrete representation can be computed, and due to numerical difficulties, each of these points itself might in general be only approximate to some efficient point. From among th...
متن کاملa new approach to solve multiple objective programming problems
multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1999
ISSN: 0022-247X
DOI: 10.1006/jmaa.1999.6541